On the Upper Bounds of MDS Codes
نویسندگان
چکیده
Let Mq(k) be the maximum length of MDS codes with parameters q, k. In this paper, the properties of Mq(k) are studied, and some new upper bounds ofMq(k) are obtained. Especially we obtain thatMq(q− 1) ≤ q+2(q ≡ 4(mod 6)), Mq(q− 2) ≤ q+1(q ≡ 4(mod 6)), Mq(k) ≤ q + k − 3 (q = 36(5s+ 1), s ∈ N and k = 6, 7).
منابع مشابه
New Constructions for q-ary Covering Codes
Upper bounds on Kq (n; R), the minimum number of codewords in a q-ary code of length n and covering radius R, are improved. Such bounds are obtained by constructing corresponding covering codes. In particular, codes of length q + 1 are discussed. Good such codes can be obtained from maximum distance separable (MDS) codes. Furthermore, they can often be combined eeectively with other covering co...
متن کاملThe Covering Problem in Rosenbloom-Tsfasman Spaces
We investigate the covering problem in RT spaces induced by the RosenbloomTsfasman metric, extending the classical covering problem in Hamming spaces. Some connections between coverings in RT spaces and coverings in Hamming spaces are derived. Several lower and upper bounds are established for the smallest cardinality of a covering code in an RT space, generalizing results by Carnielli, Chen an...
متن کاملElias Upper Bound for Euclidean Space Codes and Codes Close to the Singleton Bound
A typical communication system consists of a channel code to transmit signals reliably over a noisy channel. In general the channel code is a set of codewords which are used to carry information over the channel. This thesis deals with Elias upper bound on the normalized rate for Euclidean space codes and on codes which are close to the generalized Singleton bound, like MaximumDistance Separabl...
متن کاملThe Partition Weight Enumerator and Bounds on Mds Codes
Maximum Distance Separable (MDS) codes are those error correction codes that meet the singleton bound, thus they have the largest minimum distance possible. The main research problem is to find an upper bound on the length of the codewords when the alphabet size and dimension of the code are fixed. This paper will present a new technique using the Partition Weight Enumerator for solving this pr...
متن کاملHyperplane Sections of Grassmannians and the Number of MDS Linear Codes
We obtain some e!ective lower and upper bounds for the number of (n, k)-MDS linear codes over F q . As a consequence, one obtains an asymptotic formula for this number. These results also apply for the number of inequivalent representations over F q of the uniform matroid or, alternatively, the number of F q -rational points of certain open strata of Grassmannians. The techniques used in the de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0904.4094 شماره
صفحات -
تاریخ انتشار 2009